翻訳と辞書
Words near each other
・ Frob
・ Frobel
・ Froben Christoph of Zimmern
・ Frobenioid
・ Frobenius
・ Frobenius algebra
・ Frobenius category
・ Frobenius covariant
・ Frobenius determinant theorem
・ Frobenius endomorphism
・ Frobenius Forster
・ Frobenius group
・ Frobenius Institute
・ Frobenius manifold
・ Frobenius matrix
Frobenius method
・ Frobenius normal form
・ Frobenius Orgelbyggeri
・ Frobenius pseudoprime
・ Frobenius solution to the hypergeometric equation
・ Frobenius splitting
・ Frobenius theorem
・ Frobenius theorem (differential topology)
・ Frobenius theorem (real division algebras)
・ Frobenius's theorem (group theory)
・ Frobenius–Schur indicator
・ Froberg mutiny
・ Froberville
・ Frobisher
・ Frobisher (Doctor Who)


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Frobenius method : ウィキペディア英語版
Frobenius method
In mathematics, the Method of Frobenius, named after Ferdinand Georg Frobenius, is a way to find an infinite series solution for a second-order ordinary differential equation of the form
: z^2u''+p(z)zu'+q(z)u=0
with
: u' \equiv and u'' \equiv
in the vicinity of the regular singular point z=0. We can divide by z^2 to obtain a differential equation of the form
: u''+u'+u = 0
which will not be solvable with regular power series methods if either ''p''(''z'')/''z'' or ''q''(''z'')/''z''2 are not analytic at ''z'' = 0. The Frobenius method enables us to create a power series solution to such a differential equation, provided that ''p''(''z'') and ''q''(''z'') are themselves analytic at 0 or, being analytic elsewhere, both their limits at 0 exist (and are finite).
== Explanation ==
The Method of Frobenius tells us that we can seek a power series solution of the form
: u(z)=\sum_^\infty A_kz^, \qquad (A_0 \neq 0)
Differentiating:
: u'(z)=\sum_^\infty (k+r)A_kz^
: u''(z)=\sum_^\infty (k+r-1)(k+r)A_kz^
Substituting:
: z^2\sum_^\infty (k+r-1)(k+r)A_kz^ + zp(z) \sum_^\infty (k+r)A_kz^ + q(z)\sum_^\infty A_kz^
: = \sum_^\infty (k+r-1) (k+r)A_kz^ + p(z) \sum_^\infty (k+r)A_kz^ + q(z) \sum_^\infty A_kz^
: = \sum_^\infty (A_kz^ + p(z) (k+r) A_kz^ + q(z) A_kz^ )
: = \sum_^\infty \left(+ p(z)(k+r) + q(z)\right ) A_kz^
: = \left(r(r-1)+p(z)r+q(z) \right ) A_0z^r+\sum_^\infty \left((k+r-1)(k+r)+p(z)(k+r)+q(z) \right ) A_kz^
The expression
: r\left(r-1\right) + p\left(0\right)r + q\left(0\right) = I(r)
is known as the ''indicial polynomial'', which is quadratic in ''r''. The general definition of the ''indicial polynomial'' is the coefficient of the lowest power of ''z'' in the infinite series. In this case it happens to be that this is the ''r''th coefficient but, it is possible for the lowest possible exponent to be ''r'' − 2, ''r'' − 1 or, something else depending on the given differential equation. This detail is important to keep in mind because one can end up with complicated expressions in the process of synchronizing all the series of the differential equation to start at the same index value which in the above expression is ''k'' = 1. However, in solving for the indicial roots attention is focused only on the coefficient of the lowest power of ''z''.
Using this, the general expression of the coefficient of ''z''''k'' + ''r'' is
:I(k+r)A_k+\sum_^(0) \over (k-j)!}A_j,
These coefficients must be zero, since they should be solutions of the differential equation, so
:I(k+r)A_k+\sum_^ (0) \over (k-j)!} A_j=0
:\sum_^(0) \over (k-j)!}A_j=-I(k+r)A_k
:\sum_^(0) \over (k-j)!}A_j=A_k
The series solution with ''A''''k'' above,
:U_(z)=\sum_^A_kz^
satisfies
:z^2U_(z)''+p(z)zU_(z)'+q(z)U_(z)=I(r)z^r
If we choose one of the roots to the indicial polynomial for ''r'' in ''U''''r''(''z''), we gain a solution to the differential equation. If the difference between the roots is not an integer, we get another, linearly independent solution in the other root.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Frobenius method」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.